int sublist(LNode *A,LNode *B)
{
	LNode *p = A -> next;
	LNode *q = B -> next;

	while (p !=NULL && q != NULL)
	{
		if(p -> data == q -> data)
		{
			p = p -> next;
			q = q -> next;
		}
		else
		{
			q = B -> next;
			p = p -> next;
		}
	}

	if (q == NULL)
		return 1;
	else
		return 0;
}